Generalized Vertex Covering in Interval Graphs
نویسندگان
چکیده
Marathe, M.V., R. Ravi and C. Pandu Rangan, Generalized vertex covering in interval graphs. Discrete Applied Mathematics 39 (1992) 87-93. Given an integer i and an undirected graph G. the genera!ized i-verkx OFJPY pr&!z~ is to find a minimum set of vertices such that all chques in G of size i contain at least one vertex from this set. This problem is known to be NP-complete for chordal graphs when i is part of the input. We present a greedy linear time algorithm for this problem in the case of interval graphs.
منابع مشابه
The robust vertex centdian location problem with interval vertex weights on general graphs
In this paper, the robust vertex centdian location problem with uncertain vertex weights on general graphs is studied. The used criterion to solve the problem is the min-max regret criterion. This problem is investigated with objective function contains $lambda$ and a polynomial time algorithm for the problem is presented. It is shown that the vertex centdian problem on general graphs i...
متن کاملDetour Monophonic Graphoidal Covering Number of Corona Product Graph of Some Standard Graphs with the Wheel
A chord of a path $P$ is an edge joining two non-adjacent vertices of $P$. A path $P$ is called a monophonic path if it is a chordless path. A longest $x-y$ monophonic path is called an $x-y$ detour monophonic path. A detour monophonic graphoidal cover of a graph $G$ is a collection $psi_{dm}$ of detour monophonic paths in $G$ such that every vertex of $G$ is an internal vertex of at most on...
متن کاملON THE EDGE COVER POLYNOMIAL OF CERTAIN GRAPHS
Let $G$ be a simple graph of order $n$ and size $m$.The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set. The edge cover polynomial of $G$ is the polynomial$E(G,x)=sum_{i=rho(G)}^{m} e(G,i) x^{i}$,where $e(G,i)$ is the number of edge coverings of $G$ of size $i$, and$rho(G)$ is the edge covering number of $G$. In this paper we stud...
متن کاملLocal and union boxicity
The boxicity box(H) of a graph H is the smallest integer d such that H is the intersection of d interval graphs, or equivalently, that H is the intersection graph of axis-aligned boxes in R. These intersection representations can be interpreted as covering representations of the complement H of H with co-interval graphs, that is, complements of interval graphs. We follow the recent framework of...
متن کاملOn Interval Edge Colorings of Biregular Bipartite Graphs With Small Vertex Degrees
A proper edge coloring of a graph with colors 1, 2, 3, . . . is called an interval coloring if the colors on the edges incident to each vertex form an interval of integers. A bipartite graph is (a, b)-biregular if every vertex in one part has degree a and every vertex in the other part has degree b. It has been conjectured that all such graphs have interval colorings. We prove that all (3, 6)-b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 39 شماره
صفحات -
تاریخ انتشار 1992